Fault-Tolerant Hypercubes with Small Degree
نویسندگان
چکیده
For a given N-vertex graph. H, a graph G obtained from H by adding t vertices a,nd some edges is called a t-FT (t-fault-toleran,t) graph. for H if even after deletin.g any t vertices from G, the remaining graph contains H as a subgraph. For an N-vertex hypercube QN, a t-FT graph with an, optimal number O(tN +t2) of added edges and maximum degree of O(N + t), and a, t-FT graph zuith O(tN log N) added edges and maximum degree of O(t 1ogN) have been known. In this paper, we introduce some t-FT graphs for QN with an optimal number O(tN + t2) of added edges and small maximum degree. In particular, we show a t-FT graph, for QN with 2ctN+ct2 v ’ added edges and maxc > imum degree of 0( ,0g~~2 N) + 4ct
منابع مشابه
Fault-Tolerant Meshes and Hypercubes with Minimal Numbers of Spares
Many parallel computers consist of processors connected in the form of a d-dimensional mesh or hypercube. Twoand three-dimensional meshes have been shown to be efficient in manipulating images and dense matrices, whereas hypercubes have been shown to be well suited to divide-andconquer algorithms requiring global communication. However, even a single faulty processor or communication link can s...
متن کاملDesign of Gracefully Degradable Hypercube-Connected Systems
We address the problem of modifying a hypercube computer by the addition of spare nodes and links to improve its fault tolerance, while maintaining a specified level of performance. The hypercube is modeled by a graph in which nodes represent processors and edges represent communication links. A new graphbased measure of performance degradation is introduced. This characterizes a fault-tolerant...
متن کاملThe Balanced Hypercube: A Cube-Based System for Fault-Tolerant Applications
In this paper, we present an interconnection structure, called the balanced hypercube, which is a variation of the standard hypercube with desirable properties of strong connectivity, regularity, and symmetry. The proposed structure is a special type of load balanced graph designed to tolerate processor failure. In balanced hypercubes, each processor has a backup (matching) processor that share...
متن کاملAn Optimal d−1-Fault-Tolerant Broadcasting Scheme for d-Dimensional Hypercubes
Broadcasting is the process of information dissemination in a communication network in which a message, originated by one member, is transmitted to all members of the network. We propose a k-fault-tolerant broadcasting scheme for a faulty d-dimensional hypercube where 0≤ k<d. For the whispering model, the new scheme requires 2d time units that are optimal for faulty-hypercubes. Moreover, it onl...
متن کاملFault - Tolerant Sorting Algorithm on
In this paper, algorithmic fault-tolerant techniques are introduced for sorting algorithms on n-dimensional hypercube multicomputers. We propose a fault-tolerant sorting algorithm that can tolerate up n 1 faulty processors. First, we indicate that the bitonic sorting algorithm can perform sorting operations correctly on the hypercubes with one faulty processor. In order to tolerate up r n 1 fau...
متن کامل